Parallel Model Checking for LTL, CTL*, and Lµ2
نویسندگان
چکیده
We describe a parallel model-checking algorithm for the fragment of the μ-calculus that allows one alternation of minimal and maximal fixed-point operators. This fragment is also known as Lμ. Since LTL and CTL ∗ can be encoded in this fragment, we obtain parallel model checking algorithms for practically important temporal logics. Our solution is based on a characterization of this problem in terms of twoplayer games. We exhibit the structure of their game graphs and show that we can iteratively work with game graphs that have the same special structure as the ones obtained for Lμ-formulae. Since good parallel algorithms for colouring game-graphs for Lμ-formulae exist, it is straightforward to implement this algorithm in parallel and good run-time results can be expected.
منابع مشابه
Relating linear and branching model checking
The diierence in the complexity of branching and linear model checking has been viewed as an argument in favor of the branching paradigm. In particular, the computational advantage of CTL model checking over LTL model checking makes CTL a popular choice, leading to eecient model-checking tools for this logic. Can we use these tools in order to verify linear properties? In this paper we relate b...
متن کاملCTL* synthesis via LTL synthesis
We reduce synthesis for CTL∗ properties to synthesis for LTL. In the context of model checking this is impossible — CTL∗ is more expressive than LTL. Yet, in synthesis we have knowledge of the system structure and we can add new outputs. These outputs can be used to encode witnesses of the satisfaction of CTL∗ subformulas directly into the system. This way, we construct an LTL formula, over old...
متن کاملAnother Look at LTL Model Checking
We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a symbolic LTL model checker that appears to be quite eecient in practice. In particular, we show how the SMV model checking system developed by McMillan 16] can be extended to permit LTL spec-iications. The results that we have obtained are quit...
متن کاملModel checking finite paths and trees
This thesis presents efficient parallel algorithms for checking temporal logic formulas over finite paths and trees. We show that LTL path checking is in AC(logDCFL) and CTL tree checking is in AC(logDCFL). For LTL with pasttime and bounded modalities, which is an exponentially more succinct logic, we show that the path checking problem remains in AC(logDCFL). Our results provide a foundation f...
متن کاملLTL Model-Checking for Malware Detection
Nowadays, malware has become a critical security threat. Traditional antiviruses such as signature-based techniques and code emulation become insufficient and easy to get around. Thus, it is important to have efficient and robust malware detectors. In [23,21], CTL model-checking for PushDown Systems (PDSs) was shown to be a robust technique for malware detection. However, the approach of [23,21...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 89 شماره
صفحات -
تاریخ انتشار 2003